Condition Numbers of Random Triangular Matrices

نویسندگان

  • D Viswanath
  • L N Trefethen
چکیده

Let L n be a lower triangular matrix of dimension n each of whose nonzero entries is an independent N(0; 1) variable, i.e., a random normal variable of mean 0 and variance 1. It is shown that n , the 2-norm condition number of L n , satisses n p n ! 2 almost surely as n ! 1. This exponential growth of n with n is in striking contrast to the linear growth of the condition numbers of random dense matrices with n that is already known. This phenomenon is not due to small entries on the diagonal (i.e., small eigenvalues) of L n. Indeed, it is shown that a lower triangular matrix of dimension n whose diagonal entries are xed at 1 with the subdiagonal entries taken as independent N(0; 1) variables is also exponentially ill-conditioned with the 2-norm condition number n of such a matrix satisfying n p n ! 1:305683410: : : almost surely as n ! 1. A similar pair of results about complex random triangular matrices is established. The results for real triangular matrices are generalized to triangular matrices with entries from any symmetric, strictly stable distribution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TRIANGULAR FUZZY MATRICES

In this paper, some elementary operations on triangular fuzzynumbers (TFNs) are defined. We also define some operations on triangularfuzzy matrices (TFMs) such as trace and triangular fuzzy determinant(TFD). Using elementary operations, some important properties of TFMs arepresented. The concept of adjoints on TFM is discussed and some of theirproperties are. Some special types of TFMs (e.g. pu...

متن کامل

Condition Numbers of Random Toeplitz and Circulant Matrices

Estimating the condition numbers of random structured matrices is a well known challenge (cf. [SST06]), linked to the design of efficient randomized matrix algorithms in [PGMQ], [PIMR10], [PQ10], [PQ12], [PQZa], [PQa], [PQZb], [PQZC], [PY09]. We deduce such estimates for Gaussian random Toeplitz and circulant matrices. The former estimates can be surprising because the condition numbers grow ex...

متن کامل

TR-2012013: Condition Numbers of Random Toeplitz and Circulant Matrices

Estimating the condition numbers of random structured matrices is a well known challenge (cf. [SST06]), linked to the design of efficient randomized matrix algorithms in [PGMQ], [PIMR10], [PQ10], [PQ12], [PQZa], [PQa], [PQZb], [PQZC], [PY09]. We deduce such estimates for Gaussian random Toeplitz and circulant matrices. The former estimates can be surprising because the condition numbers grow ex...

متن کامل

An Accurate 2-norm Condition Estimator for Incomplete Factorization

Many algebraic preconditioners rely on incomplete factorization, where nonzero entries are dropped, based on some rule, during the factorization process. In a series of papers by Bollhöfer and Saad [2, 3, 4] it was shown that robust rules for both dropping and pivoting can be obtained from information about the inverses of the submatrices that are consecutively constructed. In particular, monit...

متن کامل

Lower Bounds of Copson Type for Hausdorff Matrices on Weighted Sequence Spaces

Let = be a non-negative matrix. Denote by the supremum of those , satisfying the following inequality: where , , and also is increasing, non-negative sequence of real numbers. If we used instead of The purpose of this paper is to establish a Hardy type formula for , where is Hausdorff matrix and A similar result is also established for where In particular, we apply o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996